On combining chase-2 and sum-product algorithms for LDPC codes
نویسندگان
چکیده
This letter investigates the combination of the Chase-2 and sum-product (SP) algorithms for low-density parity-check (LDPC) codes. A simple modification of the tanh rule for check node update is given, which incorporates test error patterns (TEPs) used in the Chase algorithm into SP decoding of LDPC codes. Moreover, a simple yet effective approach is proposed to construct TEPs for dealing with decoding failures with low-weight syndromes. Simulation results show that the proposed algorithm is effective in improving both the waterfall and error floor performance of LDPC codes. Disciplines Engineering | Science and Technology Studies Publication Details Tong, S. & Zheng, H. (2012). On combining chase-2 and sum-product algorithms for LDPC codes. ETRI Journal, 34 (4), 629-632. This journal article is available at Research Online: http://ro.uow.edu.au/eispapers/956 This letter investigates the combination of the Chase-2 and sum-product (SP) algorithms for low-density parity-check (LDPC) codes. A simple modification of the tanh rule for check node update is given, which incorporates test error patterns (TEPs) used in the Chase algorithm into SP decoding of LDPC codes. Moreover, a simple yet effective approach is proposed to construct TEPs for dealing with decoding failures with lowweight syndromes. Simulation results show that the proposed algorithm is effective in improving both the waterfall and error floor performance of LDPC codes.
منابع مشابه
A Study on VHDL Implementation of a Class of Irregular Structured LDPC Codes applied to 100 Gbps Optical Networks
This paper presents a study on the VHDL implementation of a class of binary irregular structured LDPC codes (IS-LDPC) applied to 100 Gbps optical networks. A comparison between two iterative decoding algorithms for irregular structured LDPC codes, sum-product based on loglikelihood ratio and min-sum, is used to define the best choice for implementation. The performances of IS-LDPC codes are eva...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کامل6.962: Week 4 Summary of Discussion Topic: Codes on Graphs 1 a Brief History of Codes on Graphs
1962 Gallager invents low density parity-check LDPC codes 1112 and what is now known as the sum-product iterative decoding algorithm for a p osteriori probability APP decoding. 1981 Tanner founds the eld of codes on graphs, introducing the bipartite graphical model now widely popular referred to as a Tanner graph" and the decoding algorithm now called the min-sum" or max-product" algorithm. Tan...
متن کاملHDL Implementation of an Efficient Partial Parallel LDPC Decoder Using Soft Bit Flip Algorithm
Nowadays Low Density Parity Check Codes (LDPC) is more in demand in Wireless Communication Systems due to its excellent performance. Use of LDPC code for encoding and decoding purposes found to be more reliable and highly efficient data transfer over wide bandwidth in presence of corrupting noise. Various Algorithms were used to interpret LDPC codes. Out of which Sum Product Algorithm and Min S...
متن کامل